Homotopic spanners
نویسندگان
چکیده
We introduce the concept of homotopic spanners in the plane with obstacles and show lower bounds on the number of edges that they require. We also provide a construction based on Θ-graphs for constructing homotopic spanners.
منابع مشابه
A Logic for Document Spanners
Document spanners are a formal framework for information extraction that was introduced by Fagin, Kimelfeld, Reiss, and Vansummeren (PODS 2013, JACM 2015). One of the central models in this framework are core spanners, which are based on regular expressions with variables that are then extended with an algebra. As shown by Freydenberger and Holldack (ICDT 2016), there is a connection between co...
متن کاملSpanners, Weak Spanners, and Power Spanners for Wireless Networks
For , a -spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most times their geometric distance. Based on this property to approximate a complete weighted graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. In a weak -spanner, this path may be arbitrary l...
متن کاملImproved Purely Additive Fault-Tolerant Spanners
Let G be an unweighted n-node undirected graph. A βadditive spanner of G is a spanning subgraph H of G such that distances in H are stretched at most by an additive term β w.r.t. the corresponding distances in G. A natural research goal related with spanners is that of designing sparse spanners with low stretch. In this paper, we focus on fault-tolerant additive spanners, namely additive spanne...
متن کاملIndependent tree spanners: fault-tolerant spanning trees with constant distance guarantees
For any xed rational parameter t 1, a (tree) t{spanner of a graph G is a spanning subgraph (tree) T in G such that the distance between every pair of vertices in T is at most t times their distance in G. General t{spanners and their variants have multiple applications in the eld of communication networks, distributed systems, and network design. In this paper, we combine the two concepts of sim...
متن کاملCollective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width
In this paper we study collective additive tree spanners for special families of graphs including planar graphs, graphs with bounded genus, graphs with bounded tree-width, graphs with bounded cliquewidth, and graphs with bounded chordality. We say that a graph G = (V,E) admits a system of μ collective additive tree r-spanners if there is a system T (G) of at most μ spanning trees of G such that...
متن کامل